Cutting optimisation with variable-sized stock and inventory status data

نویسندگان

  • Leon Kos
  • Jože Duhovnik
چکیده

Many production environments require economical cutting of onedimensional items according to bills of materials from objects of several standard lengths. However, even with optimised cutting substantial trim loss may occur. This trim loss should not be regarded as waste. It is returned to store and can be reused in future optimisations. Optimisation of packing linear items into standard lengths is presented for items which cannot be packed into available lengths from inventory status data. The core of the proposed optimisation tackles the variable-sized bin packing problem (VBPP). The article presents a hybrid genetic algorithm which packs items into both available objects from the inventory and variable-sized objects from the stock. The algorithm tries to minimise waste. Large trim-loss items are returned as remnants to the inventory for subsequent optimisations. ∗To whom correspondence should be addressed. e-mail: [email protected] †University of Ljubljana, Faculty of Mechanical Engineering, Aškerčeva 6, SI-1000 Ljubljana, Slovenia

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem

In this work we consider the 3-staged 2-dimensional cutting stock problem, which appears in many real-world applications such as glass and wood cutting and various scheduling tasks. We suggest a variable neighborhood search (VNS) employing “ruin-and-recreate”based very large neighborhood searches (VLNS). We further present a polynomial-sized integer linear programming model (ILP) for solving th...

متن کامل

Solving an one-dimensional cutting stock problem by simulated annealing and tabu search

A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...

متن کامل

An optimal inventory pricing and ordering strategy subject to demand dependent on stock level and price

This article considers the deterministic singular optimal control problem of profit maximisation for inventory replenished at a variable rate and depleted by demand which is assumed to vary with price and stock availability. Optimal policies for the product order rate and price are derived using the maximum principle. Several initial inventory regions are identified as potential inventory state...

متن کامل

Ant Colony Optimisation and Local Search for Bin Packing and Cutting Stock Problems

The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimisation problems. Exact solution methods can only be used for very small instances, so for real-world problems we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary ...

متن کامل

Genetic Algorithms for Cutting Stock Problems: With and Without Contiguity

A number of optimisation problems involve the optimal grouping of a finite set of items into a number of categories subject to one or more constraints. Such problems raise interesting issues in mapping solutions in genetic algorithms. These problems range from the knapsack problem to bin packing and cutting stock problems. This paper describes research involving cutting stock problems. Results ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002